A directed cycle-based column-and-cut generation method for capacitated survivable network design

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A directed cycle-based column-and-cut generation method for capacitated survivable network design

A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here we present a polyhedral approach for designing survivable networks. We describe a mixed–integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of ...

متن کامل

Accelerating Column Generation for a Survivable Network Design Problem

We consider a network design problem occurring in the extension of fiber optic networks on the last mile which generalizes the (Price Collecting) Steiner Tree Problem by introducing redundancy requirements on some customer nodes. In this work we present a formulation for this problem based on exponentially many variables and solve its linear relaxation by column generation. Using alternative du...

متن کامل

Partition inequalities for capacitated survivable network design based on directed p-cycles

We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failures. Survivability of the network is accomplished by reserving sufficient slack on directed p-cycles so that if an edge fails, its flow can be rerouted along the p-cycles. We describe a model for designing capacitated s...

متن کامل

The Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut

Telecommunication networks can be seen as the stacking of several layers like, for instance, IPover-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable...

متن کامل

On cut-based inequalities for capacitated network design polyhedra

In this article we study capacitated network design problems. We unify and extend poly-hedral results for directed, bidirected and undirected link capacity models. Based on validinequalities for a network cut we show that regardless of the link capacity model, facets of thepolyhedra associated with such a cut translate to facets of the original network design polyhedraif the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2004

ISSN: 0028-3045

DOI: 10.1002/net.20004